A Review of Testu01

نویسنده

  • B. D. McCULLOUGH
چکیده

The scientific literature is filled with examples of bad random number generators (RNGs), and a bad RNG can completely ruin a researcher’s analysis. See Coddington (1994, 1996) for examples and discussion from the field of physics. Examples from economics are difficult to find, in part, because many economists do not bother to test the RNGs that they use in their applied work. This may be due to the fact that they are unaware of any need to test the RNG. Econometrics texts simply assume (incorrectly) that RNGs work perfectly as advertised, despite the fact that many RNGs found in commercial software routinely fail randomness tests (L’Ecuyer, 1997, 2001). This is all the more shocking, since simulation results depend on the quality of the random numbers used as input—though one would hardly know this from reading books on simulation (e.g., Gourieroux and Montfort, 1996). If experts and textbooks fail to address the issue, the practicing economist can hardly be faulted. Even among economists who are aware of the issue, there is a hesitancy to test RNGs due a common sentiment: ‘I would probably just find that my RNGs fail one or more obscure tests, and I would have no idea of how to interpret such failures.’ Such a sentiment is understandable, but it misconstrues the purpose of randomness testing. As a practical matter, it is the province of the RNG expert, and not the economist, to interpret these failures. The economist’s job is simply to avoid RNGs that fail tests—not all tests, for there is no RNG that will pass all tests. The economist should avoid RNGs that fail ‘reasonable’ tests. What constitutes a reasonable test has been succinctly stated by L’Ecuyer (2004):

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding up TestU01 with the use of HTCondor

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v

متن کامل

One Random Jump and One Permutation: Sufficient Conditions to Chaotic, Statistically Faultless, and Large Throughput PRNG for FPGA

Sub-categories of mathematical topology, like the mathematical theory of chaos, offer interesting applications devoted to information security. In this research work, we have introduced a new chaos-based pseudorandom number generator implemented in FPGA, which is mainly based on the deletion of a Hamilton cycle within the n-cube (or on the vectorial negation), plus one single permutation. By do...

متن کامل

Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation

It is well-known that the quality of random number generators can often be improved by combining several generators, e.g. by summing or subtracting their results. In this paper we investigate the ratio of two random number generators as an alternative approach: the smaller of two input random numbers is divided by the larger, resulting in a rational number from [0, 1]. We investigate theoretica...

متن کامل

Random Number Generation in gretl

The increasing popularity and complexity of random number intensive methods such as simulation and bootstrapping in econometrics requires researchers to have a good grasp of random number generation in general, and the specific generators that they employ in particular. Here, we discuss the random number generation options, their specifications, and their implementations in gretl. We also asses...

متن کامل

Introduction to Secure PRNGs

Pseudo-Random Number Generators (PRNGs) are required for generating secret keys in cryptographic algorithms, generating sequences of packet in Network simulations (workload generators) and other applications in various fields. In this paper we will discuss a list of some requirements for generating a reliable random sequence and then will present some PRNG methods which are based on combination...

متن کامل

Design and Implementation of a High Quality and High Throughput TRNG in FPGA

This paper focuses on the design and implementation of a high-quality and high-throughput true-random number generator (TRNG) in FPGA. Various practical issues which we encountered are highlighted and the influence of the various parameters on the functioning of the TRNG are discussed. We also propose a few values for the parameters which use the minimum amount of the resources but still pass c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006